Delimiting the urban growth boundaries with a modified ant colony optimization model

نویسندگان

  • Shifa Ma
  • Xia Li
  • Yumei Cai
چکیده

Article history: Received 8 December 2015 Received in revised form 5 November 2016 Accepted 11 November 2016 Available online xxxx Delimiting urban growth boundaries (UGBs) has been generally regarded as a regulatorymeasure for controlling chaotic urban expansion. There are increasing demands for delimiting urban growth boundaries in fast growing regions in China. However, existingmethods for delimiting UGBsmainly focus on intrinsic dynamic processes of urban growth and ignore external planning interventions. Delimiting UGBs to restrain chaotic expansion and conserve ecological areas is actually a spatial optimization problem. This study aims to develop an optimization-based framework for delimiting optimal UGBs by incorporating dynamic processes and planning interventions into an ant colony optimization (ACO) algorithm. Local connectivity, total utility values and quantity assignment were integrated into the exchange mechanism to make ACO adaptive for the delimitation of UGBs. The core area of Changsha-Zhuzhou-Xiangtan urban agglomeration, a very fast growing area in Central China was selected as the case study area to validate the proposed model. UGBs under multi planning scenarios with given combinations of weights for urban suitability, high-quality farmland protection, and landscape compactness were efficiently derived from the ACO model. Hypothetic datasets were initially used to test the performance of ACO on global optimum and its ability to optimize complex landscape patterns. Compared with experts' planning scenario, the optimal UGBs delimited byACOmodel is practical. Results indicate that spatial optimization methods are plausible for delimiting optimal UGBs. © 2016 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A mathematical model for designing optimal urban gas networks, an ant colony algorithm and a case study

Considering the high costs of the implementation and maintenance of gas distribution networks in urban areas, optimal design of such networks is vital. Today, urban gas networks are implemented within a tree structure. These networks receive gas from City Gate Stations (CGS) and deliver it to the consumers. This study presents a comprehensive model based on Mixed Integer Nonlinear Programming (...

متن کامل

Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm

In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Dynamic Multi-Objective Navigation in Urban Transportation Network Using Ant Colony Optimization

Intelligent Transportation System (ITS) is one of the most important urban systems that its functionality affects other urban systems directly and indirectly. In developing societies, increasing the transportation system efficiency is an important concern, because variety of problems such as heavy traffic condition, rise of the accident rate and the reduced performance happen with the rise of p...

متن کامل

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers, Environment and Urban Systems

دوره 62  شماره 

صفحات  -

تاریخ انتشار 2017